Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
نویسندگان
چکیده
منابع مشابه
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs Θ(n) bits are necessary and sufficient for shortest path routing. By ‘almost all graphs’ we mean the Kolmogorov random graphs which constitute a fraction of 1− 1/nc of all grap...
متن کاملThe Compactness of Interval Routing for Almost All Graphs
Interval routing is a compact way of representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show that almost all the graphs, i.e., a fraction of at least 1 − 1/n2 of all the n-node graphs, support a sh...
متن کاملRouting Tables for Message Routing in Distributed Double Loop Networks
Distributed double loop networks are very advantageous for the design and implementation of local area networks and parallel processing architectures, mainly due to their fault-tolerance, low communication latency, and regularity. In this paper, an algorithm for the formulation of routing tables that facilitate routing of messages in a distributed double loop network is presented. The algorithm...
متن کاملThe Incompressibility Method
Kolmogorov complexity is a modern notion of randomness dealing with the quantity of information in individual objects; that is, pointwise randomness rather than average randomness as produced by a random source. It was proposed by A.N. Kolmogorov in 1965 to quantify the randomness of individual objects in an objective and absolute manner. This is impossible for classical probability theory. Kol...
متن کاملRouting in all optical networks using recursive state space technique
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm mus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1999
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539796308485